Computing Open Locating-Dominating Number of Some Rotationally-Symmetric Graphs

Location detection is studied for many scenarios, such as pointing out the flaws in multiprocessors, invaders buildings and facilities, utilizing wireless sensor networks monitoring environmental processes. The system or structure can be illustrated a graph each of these applications. Sensors strategically placed at subset vertices determine identify irregularities within network. open locating-dominating set S G=(V,E) that dominates G, any i,j∈ V(G) N(i)∩S≠N(j)∩S satisfied. called OLD-set G. cardinality number denoted by γold(G). In this paper, we computed exact values prism prism-related graphs, also convex polytopes Rn Hn. upper bound determined other classes polytopes. graphs considered here are well-known from literature.